Turkıc Republics And Thirty-Four Letter Common Latin Alphabet

Decomposition theorem for invertible substitutions on three - letter alphabet ∗

We study the structure of invertible substitutions on three-letter alphabet. We show that there exists a finite set S of invertible substitutions such that any invertible substitution can be written as Iw ◦ σ1 ◦ σ2 ◦ · · · ◦ σk, where Iw is the inner automorphism associated with w, and σj ∈ S for 1 ≤ j ≤ k. As a consequence, M is the matrix of an invertible substitution if and only if it is a f...

Composing short 3-compressing words on a 2 letter alphabet

A finite deterministic (semi)automaton A = (Q,Σ, δ) is kcompressible if there is some word w ∈ Σ such that the image of the state set Q under the natural action of w is reduced by at least k states. Such word, if it exists, is called a k-compressing word for A. A word is k-collapsing if it is k-compressing for each k-compressible automaton. We compute a set Γ of short words such that all 3-comp...

Unambiguous Conjunctive Grammars over a One-Letter Alphabet

It is demonstrated that unambiguous conjunctive grammars over a unary alphabet Σ = {a} have non-trivial expressive power, and that their basic properties are undecidable. The key result is that for every base k > 11 and for every one-way real-time cellular automaton operating over the alphabet of base-k digits { d k+9 4 e, . . . , b k+1 2 c } , the language of all strings a with the base-k nota...

A Class of Two Generated Automaton Groups on a Three Letter Alphabet

Risk and other four-letter words.

Find the secret to improve the quality of life by reading this risk and other four letter words. This is a kind of book that you need now. Besides, it can be your favorite book to read after having this book. Do you ask why? Well, this is a book that has different characteristic with others. You may not need to know who the author is, how wellknown the work is. As wise word, never judge the wor...